Infeasible start semidefinite programming algorithms via self - dual embeddings Report 97 - 10
نویسندگان
چکیده
The development of algorithms for semide nite programming is an active research area, based on extensions of interior point methods for linear programming. As semide nite programming duality theory is weaker than that of linear programming, only partial information can be obtained in some cases of infeasibility, nonzero optimal duality gaps, etc. Infeasible start algorithms have been proposed which yield di erent kinds of information about the solution. In this paper a comprehensive treatment of a speci c initialization strategy is presented, namely self-dual embedding, where the original primal and dual problems are embedded in a larger problem with a known interior feasible starting point. A framework for infeasible start algorithms with the best obtainable complexity bound is thus presented. The information that can be obtained in case of infeasibility, unboundedness, etc., is stated clearly. Important unresolved issues are discussed. iii
منابع مشابه
A path-following infeasible interior-point algorithm for semidefinite programming
We present a new algorithm obtained by changing the search directions in the algorithm given in [8]. This algorithm is based on a new technique for finding the search direction and the strategy of the central path. At each iteration, we use only the full Nesterov-Todd (NT)step. Moreover, we obtain the currently best known iteration bound for the infeasible interior-point algorithms with full NT...
متن کاملInitialization in semidefinite programming via a self-dual skew-symmetric embedding
The formulation of interior point algorithms for semide nite programming has become an active research area, following the success of the methods for large{ scale linear programming. Many interior point methods for linear programming have now been extended to the more general semide nite case, but the initialization problem remained unsolved. In this paper we show that the initialization strate...
متن کاملApproximation algorithms via randomized rounding: a survey
Approximation algorithms provide a natural way to approach computationally hard problems. There are currently many known paradigms in this area, including greedy algorithms, primal-dual methods, methods based on mathematical programming (linear and semidefinite programming in particular), local improvement, and “low distortion” embeddings of general metric spaces into special families of metric...
متن کاملA polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP
Convex quadratic semidefinite programming (QSDP) has been widely applied in solving engineering and scientific problems such as nearest correlation problems and nearest Euclidean distance matrix problems. In this paper, we study an inexact primal-dual infeasible path-following algorithm for QSDP problems of the form: minX{12X • Q(X) + C •X : A(X) = b, X 0}, where Q is a self-adjoint positive se...
متن کامل